#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cmath>
#include <cstring>

using namespace std;

class Solution
{
public:
    int countBalancedPermutations(string num)
    {
        int sum = 0, n = num.size();
        for (int i = 0; i < n; i++)
            sum += num[i] - '0';

        if (sum & 1)
            return 0;

        
    }
};

int main()
{

    // system("pause");
    return 0;
}
